On decidability properties of local sentences
نویسندگان
چکیده
منابع مشابه
On decidability properties of local sentences
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the finite and the infinite model theory of these sentences [Res88]. Another stretching theorem of Finkel and Ressayre implies that one can decide, for a given local sentence φ and an ordinal α < ωω, whether φ has a model o...
متن کاملDecidability of code properties
We explore the borderline between decidability and undecidability of the following question: “Let C be a class of codes. Given a machineM of type X , is it decidable whether the language L(M) lies in C or not?” for codes in general, ω-codes, codes of finite and bounded deciphering delay, prefix, suffix and bi(pre)fix codes, and for finite automata equipped with different versions of push-down s...
متن کاملDecidability Properties of Recursive Types
In this paper we study decision problems and invertibility for two notions of equivalence of recursive types. In particular, for recursive types presented by means of a recursion operator μ, we describe an algorithm showing that the natural equivalence generated by finitely many steps of folding and unfolding of μ-types is decidable. For recursive types presented by finite systems of recursive ...
متن کاملOn the Decidability of Temporal Properties of Probabilistic Pushdown Automata
We consider qualitative and quantitative model-checking problems for probabilistic pushdown automata (pPDA) and various temporal logics. We prove that the qualitative and quantitative model-checking problem for ω-regular properties and pPDA is in 2-EXPSPACE and 3-EXPTIME, respectively. We also prove that model-checking the qualitative fragment of the logic PECTL∗ for pPDA is in 2-EXPSPACE, and ...
متن کاملOn the Decidability of Verifying LTL Properties of GOLOG Programs∗
The high-level action programming language GOLOG is a useful means for modeling the behavior of autonomous agents such as mobile robots. It relies on a representation given in terms of a logic-based action theory in the Situation Calculus (SC). To guarantee that the possibly non-terminating execution of a GOLOG program leads to the desired behavior of the agent, it is desirable to (automaticall...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.08.004